Equivalence classes of 5-bit Gray codes
نویسندگان
چکیده
An n-bit gray code can be represented as a hamilton cycle in the n-cube together with a direction. Two n-bit gray codes are equivalent if there is an automorphism of the n-cube that maps the edge set of one onto the other. In this paper we detail a method for counting the number of equivalence classes of 5-bit gray codes, and classify the equivalence classes according to the distribution of the bit-positions in their transition sequences.
منابع مشابه
On cardinalities of k-abelian equivalence classes
Two words u and v are k-abelian equivalent if for each word x of length at most k, x occurs equally many times as a factor in both u and v. The notion of k-abelian equivalence is an intermediate notion between the abelian equivalence and the equality of words. In this paper, we study the equivalence classes induced by the k-abelian equivalence, mainly focusing on the cardinalities of the classe...
متن کاملA Note on 5-bit Quadratic Permutations' Classification
Classification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms. We show that there exist 75 affine equivalence classes of 5-bit quadratic permutations. Furthermore, we explore important cryptographic properties of these classes, such as linear and differential properties and degrees...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملOptimization, Matroids and Error-Correcting Codes
The first subject we investigate in this thesis deals with optimization problems on graphs. The edges are given costs defined by the values of independent exponential random variables. We show how to calculate some or all moments of the distributions of the costs of some optimization problems on graphs. The second subject that we investigate is 1-error correcting perfect binary codes, perfect c...
متن کاملBinary Gray Codes with Long Bit Runs
We show that there exists an n-bit cyclic binary Gray code all of whose bit runs have length at least n − 3 log2 n. That is, there exists a cyclic ordering of {0, 1}n such that adjacent words differ in exactly one (coordinate) bit, and such that no bit changes its value twice in any subsequence of n − 3 log2 n consecutive words. Such Gray codes are ‘locally distance preserving’ in that Hamming ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 39 شماره
صفحات -
تاریخ انتشار 2007